Updating RDFS ABoxes and TBoxes in SPARQL
نویسندگان
چکیده
Updates in RDF stores have recently been standardised in the SPARQL 1.1 Update specification. However, computing answers entailed by ontologies in triple stores is usually treated orthogonal to updates. Even the W3C’s recent SPARQL 1.1 Update language and SPARQL 1.1 Entailment Regimes specifications explicitly exclude a standard behaviour how SPARQL endpoints should treat entailment regimes other than simple entailment in the context of updates. In this paper, we take a first step to close this gap. We define a fragment of SPARQL basic graph patterns corresponding to (the RDFS fragment of) DL-Lite and the corresponding SPARQL update language, dealing with updates both of ABox and of TBox statements. We discuss possible semantics along with potential strategies for implementing them. We treat both, (i) materialised RDF stores, which store all entailed triples explicitly, and (ii) reduced RDF Stores, that is, redundancy-free RDF stores that do not store any RDF triples (corresponding to DL-Lite ABox statements) entailed by others already.
منابع مشابه
Towards SPARQL Instance-Level Update in the Presence of OWL-DL TBoxes
Represented knowledge is subject to frequent changes. To meet these requirements for dynamics, SPARQL update, an update language for RDF graphs, was developed. Even though there is some research on semantics of SPARQL ABox update for RDFS ontologies and approaches addressing updates in interplay with rather restricted TBoxes languages, up till now there is no definition of semantics for SPARQL ...
متن کاملAdding DL-Lite TBoxes to Proper Knowledge Bases
Levesque’s proper knowledge bases (proper KBs) correspond to infinite sets of ground positive and negative facts, with the notable property that for FOL formulas in a certain normal form, which includes conjunctive queries and positive queries possibly extended with a controlled form of negation, entailment reduces to formula evaluation. However proper KBs represent extensional knowledge only. ...
متن کاملDealing with Inconsistencies due to Class Disjointness in SPARQL Update
The problem of updating ontologies has received increased attention in recent years. In the approaches proposed so far, either the update language is restricted to (sets of) atomic updates, or, where the full SPARQL Update language is allowed, the TBox language is restricted to RDFS where no inconsistencies can arise. In this paper we discuss directions to overcome these limitations. Starting f...
متن کاملEfficient evaluation of SPARQL over RDFS graphs
Evaluating queries over RDFS is currently done by computing the closure, which is quadratic in the worst case. In this paper, we show how to evaluate SPARQL over RDFS graphs by using a navigational language grounded in standard relational algebra with operators for navigating triples with regular constraints. In particular, we show that there is a fragment of this language with linear time data...
متن کاملDiego Calvanese Boris Konev 28 th International Workshop on Description Logics Athens , Greece 7 – 10 June 2015
The problem of updating ontologies has received increased attentionin recent years. In the approaches proposed so far, either the update language isrestricted to (sets of) atomic updates, or, where the full SPARQL Update languageis allowed, the TBox language is restricted to RDFS where no inconsistencies canarise. In this paper we discuss directions to overcome these limitations...
متن کامل